SLOPE-BASED PATH SHIFT PROPENSITY ALGORITHM FOR THE STATIC TRAFFIC ASSIGNMENT PROBLEM
نویسندگان
چکیده
منابع مشابه
Slope-based Path Shift Propensity Algorithm for the Static Traffic Assignment Problem
This paper presents a path-based traffic assignment algorithm for solving the static deterministic user equilibrium traffic assignment problem. It uses the concepts of the path shift-propensity factor and the sensitivity of path costs with respect to path flows in the flow update process, and is labeled as the slope-based path shift-propensity algorithm (SPSA). It seeks to enable faster converg...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولProbit-Based Traffic Assignment: A Comparative Study between Link-Based Simulation Algorithm and Path-Based Assignment and Generalization to Random-Coefficient Approach
Probabilistic approach of traffic assignment has been primarily developed to provide a more realistic and flexible theoretical framework to represent traveler’s route choice behavior in a transportation network. The problem of path overlapping in network modelling has been one of the main issues to be tackled. Due to its flexible covariance structure, probit model can adequately address the pro...
متن کاملA hybrid algorithm for the path center problem
Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...
متن کاملA Path-Based Algorithm for the Cross-Nested Logit Stochastic User Equilibrium Traffic Assignment
This paper investigates the single-class static stochastic user equilibrium (SUE) problem with separable and additive link costs. A SUE assignment based on the Cross-Nested Logit (CNL) route choice model is presented. The CNL model can better represent route choice behavior compared to the Multinomial Logit (MNL) model, while keeping a closed form equation. The paper uses a specific optimizatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INTERNATIONAL JOURNAL FOR TRAFFIC AND TRANSPORT ENGINEERING
سال: 2014
ISSN: 2217-544X,2217-5652
DOI: 10.7708/ijtte.2014.4(3).05